Facets in the Crossing Number Polytope
نویسنده
چکیده
In the last years, several integer linear programming (ILP) formulations for the crossing number problem arose. While they all contain a common conceptual core, the properties of the corresponding polytopes have never been investigated. In this paper, we formally establish the crossing number polytope and show several facet-defining constraint classes.
منابع مشابه
A Polyhedral Approach to the Multi-Layer Crossing Minimization Problem
We study the multi-layer crossing minimization problem from a polyhedral point of view. After the introduction of an integer programming formulation of the multi-layer crossing minimization problem, we examine the 2-layer case and derive several classes of facets of the associated polytope. Preliminary computational results for 2-and 3-layer instances indicate, that the usage of the correspondi...
متن کاملJ an 2 00 4 Construction techniques for cubical complexes , odd cubical 4 - polytopes , and prescribed dual manifolds
We provide a number of new construction techniques for cubical complexes and cubical polytopes, and thus for cubifications (hexahedral mesh generation). As an application we obtain an instance of a cubical 4-polytope that has a non-orientable dual manifold (a Klein bottle). This confirms an existence conjecture of Hetyei (1995). More systematically, we prove that every normal crossing codimensi...
متن کاملConstruction Techniques for Cubical Complexes, Odd Cubical 4-Polytopes, and Prescribed Dual Manifolds
We provide a number of new construction techniques for cubical complexes and cubical polytopes, and thus for cubifications (hexahedral mesh generation). As an application we obtain an instance of a cubical 4-polytope that has a non-orientable dual manifold (a Klein bottle). This confirms an existence conjecture of Hetyei (1995). More systematically, we prove that every normal crossing codimensi...
متن کاملSome Facets of the Polytope of Even Permutation Matrices
We describe a class of facets of the polytope of convex combinations of the collection of even n × n permutation matrices. As a consequence, we prove the conjecture of Brualdi and Liu [4] that the number of facets of the polytope is not bounded by a polynomial in n.
متن کاملGeometric shellings of 3-polytopes
A total order of the facets of a polytope is a geometric shelling if there exists a combinatorially equivalent polytope in which the corresponding order of facets becomes a line shelling. The subject of this paper is (geometric) shellings of 3-polytopes. Recently, a graph theoretical characterization of geometric shellings of 3-polytopes were given by Holt & Klee and Mihalisin & Klee. We rst gi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 25 شماره
صفحات -
تاریخ انتشار 2011